/*
	This file is part of AVRCppLib.

    AVRCppLib is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    AVRCppLib is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with AVRCppLib.  If not, see <http://www.gnu.org/licenses/>.

    Copyright (C) Maxime Lemonnier 2007-2011
 */

#include "../Utils/BitManipulation.h"

template <typename ElementType>
Node<ElementType>::Node (const ElementType& el, Node<ElementType>  * next, Node<ElementType>  * previous) :
next(next), previous(previous), el(el)
{
}

template <typename ElementType>
void Node<ElementType>::changeNext(Node<ElementType> * newNext)
{
	if(isNull(newNext))
	{
		this->next = NULL;
	}
	else
	{
		newNext->next = this->next;
		if(!isNull(newNext->next))
			newNext->next->previous = newNext;
		this->next = newNext;
		newNext->previous = this;
	}

}

template <typename ElementType>
void Node<ElementType>::changePrevious(Node<ElementType> * newPrevious)
{
	if(isNull(newPrevious))
	{
		this->previous = NULL;
	}
	else
	{
		newPrevious->previous = this->previous;
		if(!isNull(newPrevious->previous))
			newPrevious->previous->next = newPrevious;

		this->previous = newPrevious;
		newPrevious->next = this;
	}
}

template <typename ElementType>
void Node<ElementType>::unlink()
{
	if(!isNull(this->previous))
		this->previous->next = this->next;
	if(!isNull(this->next))
		this->next->previous = this->previous;

}
